منابع مشابه
Inclusion-exclusion meets exclusion
When evaluating the inclusion-exclusion expansion N0 −N(1) −N(2) − · · ·+N(1, 2) +N(1, 3) + · · · many of the terms N(· · ·) may turn out to be zero, and hence should be discarded beforehand. Often this can be done.
متن کاملThe Inclusion-Exclusion Principle for IF-States
Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events.In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski's inclusion-exclusion principle for probabilities on IF-events.Finally, we give some applications of this principle by...
متن کاملQuick Inclusion-Exclusion
Many data mining algorithms make use of the well-known Inclusion-Exclusion principle. As a consequence, using this principle efficiently is crucial for the success of all these algorithms. Especially in the context of condensed representations, such as NDI, and in computing interesting measures, a quick inclusion-exclusion algorithm can be crucial for the performance. In this paper, we give an ...
متن کاملSymmetric Inclusion-Exclusion
One form of the inclusion-exclusion principle asserts that if A and B are functions of finite sets then the formulas A(S) = ∑ T⊆S B(T ) and B(S) = ∑ T⊆S(−1) |S|−|T A(T ) are equivalent. If we replace B(S) by (−1)B(S) then these formulas take on the symmetric form A(S) = ∑ T⊆S (−1) B(T ) B(S) = ∑ T⊆S (−1) A(T ). which we call symmetric inclusion-exclusion. We study instances of symmetric inclusi...
متن کاملSYMMETRIC INCLUSION - EXCLUSION Ira
One form of the inclusion-exclusion principle asserts that if A and B are functions of finite sets then the formulas A(S) = ∑ T⊆S B(T ) and B(S) = ∑ T⊆S(−1) |A(T ) are equivalent. If we replace B(S) by (−1)|S|B(S) then these formulas take on the symmetric form A(S) = ∑
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2015
ISSN: 0895-4801,1095-7146
DOI: 10.1137/140991364